Taxonomy of space tessellation

نویسندگان

  • Y. C. Lee
  • Y. L. Li
چکیده

When we map an area or create a digital database for it, the first task is often to partition the space into smaller units. There are traditionally two methods of partitioning: vector and raster. A vector partition delineates the boundary of features by polylines while a raster partition subdivides the space into a regular matrix of square or rectangular pixels. These two are complementary methods of subdividing the space either by features or by unconstrained space cells. In the third dimension, they are extended to polyhedra and voxels, respectively. We will argue in this paper that the terms AvectorB and ArasterB cannot describe all cases of tessellation. With advances in data modelling, variations of the two traditional methods have been developed, such as the representation of a feature by pixels and not by polylines. At present, there is a lack of systematic terminology to describe the various methods of tessellation. In this paper, we will propose a taxonomy for three-dimensional space tessellation. Its essential feature is to distinguish between abstract concepts of tessellation and their encoding methods. We recognise that tessellation of geographic space is carried out in different stages with increasingly precise mathematical meaning. This provides us with an insight into the process of spatial tessellation and a model to systematically describe the various structures. These concepts could form a basis for spatial data models. q 2000 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Taxonomy of 2d Space Tessellation

When we map an area or create a digital database for it, the first task is often to partition the space into smaller units. There are traditionally two methods of partition called vector and raster. A vector partition delineates the boundary of features by lines while a raster partition subdivides space into a regular matrix of square or rectangular pixels. The two partitions are complementary ...

متن کامل

A Stochastic Tessellation of Digital Space

A tessellation which is capable of producing rough boundaries is proposed. Some properties of the proposed tessellation are also described.

متن کامل

Near-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces

A new adaptive tessellation method for general CatmullClark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adaptive tessellation for rendering purpose is a recursive error evaluation and globalization process. The adaptive tessellation process is done by generating an inscribing polyhedron to approximate the limit surface for each indiv...

متن کامل

Hierarchical Feature Extraction using a Self-Organized Retinal Receptive Field Sampling Tessellation

This paper examines the problem of hierarchical processing of visual information extracted with a layer of pseudo-randomly tessellated retinal receptive fields. Afferents from the retinal neural layer were processed by a cortical neuron layer resulting in a hierarchy of feature extraction operations similar to that found in biological vision systems. The retinal tessellation was obtained by sel...

متن کامل

An artificial retina with a self-organised retinal receptive field tessellation

In this paper we present a means to generate a receptive field tessellation for an artificial retina using a self-organisation methodology. The approach addresses the problem of creating a receptive field tessellation that seamlessly changes from the uniform fovea to the spacevariant periphery of a retina. We sampled and reconstructed images by placing overlapping space-variant receptive fields...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000